ILP and Iterative LP Solutions for Peak and Average Power Optimization in HLS
نویسندگان
چکیده
In this paper, we tackle the problem of peak and average power optimization in high-level synthesis. Because of the quadratic relationship of supply-voltage to the dynamic power consumption, voltage scaling is considered as the most efficient technique for reducing power consumptions in CMOS circuits. We present an MILP formulation for the scheduling problem using multiple supply-voltages in order to optimize peak power as well as average power and energy consumptions. As the design problem becomes large, exact solution takes a tremendous amount of run-time; and to explore the design space in a reasonable amount of time, a high quality heuristic is needed. Thus, we devise a two-phase heuristic to solve the multiple supply-voltages scheduling for peak and average power minimization. In the first phase, a guided LP relaxation is developed. Following the relaxed LP schedule, a power-area-saving procedure is developed. Results for peak and average power of our two-phase heuristic well match those obtained by the optimal solution as has been validated through extensive experiments on several benchmarks.
منابع مشابه
A New Goal programming approach for cross efficiency evaluation
Cross efficiency evaluation was developed as an extension of DEA. But the traditional DEA models usually have alternative optimal solutions and, as a result, cross efficiency scores may not be unique. It is recommended that without changing the DEA efficiency scores, the secondary goal should be introduced for optimization of the inputs/outputs weights. Several reports evaluated the perfo...
متن کاملAn efficient CAD tool for High-Level Synthesis of VLSI digital transformers
Digital transformers are considered as one of the digital circuits being widely used in signal and data processing systems, audio and video processing, medical signal processing as well as telecommunication systems. Transforms such as Discrete Cosine Transform (DCT), Discrete Wavelet Transform (DWT) and Fast Fourier Transform (FFT) are among the ones being commonly used in this area. As an illu...
متن کاملParticle Swarm Optimization for ILP Model Based Scheduling
This paper focus on the optimal solution to the time constraint scheduling problem with the Integer Linear Programming (ILP) modeling for synthesis using Particle Swarm Optimization; an efficient population based search technique.Discrete real space has explored with continuous domain exploration in restricted range and exploitation using nearest discrete value to get convergence faster.The per...
متن کاملEfficiently Solving Repeated Integer Linear Programming Problems by Learning Solutions of Similar Linear Programming Problems using Boosting Trees
It is challenging to obtain online solutions of large-scale integer linear programming (ILP) problems that occur frequently in slightly different forms during planning for autonomous systems. We refer to such ILP problems as repeated ILP problems. The branch-and-bound (BAB) algorithm is commonly used to solve ILP problems, and a significant amount of computation time is expended in solving nume...
متن کاملSolving and analyzing side-chain positioning problems using linear and integer programming
MOTIVATION Side-chain positioning is a central component of homology modeling and protein design. In a common formulation of the problem, the backbone is fixed, side-chain conformations come from a rotamer library, and a pairwise energy function is optimized. It is NP-complete to find even a reasonable approximate solution to this problem. We seek to put this hardness result into practical cont...
متن کامل